Algorithmic and complexity aspects of simple coalitional games
نویسنده
چکیده
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Biographical sketch . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
منابع مشابه
Representation of coalitional games with algebraic decision diagrams
With the advent of algorithmic coalitional game theory, it is important to design coalitional game representation schemes that are both compact and efficient with respect to solution concept computation. To this end, we propose a new representation for coalitional games, which is based on Algebraic Decision Diagrams (ADDs). Our representation is fully expressive, compact for many games of pract...
متن کاملAlgorithmic Issues in Coalitional and Dynamic Network Games
We discuss some new algorithmic and complexity issues in coalitional and dynamic/evolutionary games, related to the understanding of modern selfish and Complex networks. In particular: (a) We examine the achievement of equilibria via natural distributed and greedy approaches in networks. (b) We present a model of a coalitional game in order to capture the anarchy cost and complexity of construc...
متن کاملSimple Coalitional Games with Beliefs
We introduce coalitional games with beliefs (CGBs), a natural generalization of coalitional games to environments where agents possess private beliefs regarding the capabilities (or types) of others. We put forward a model to capture such agent-type uncertainty, and study coalitional stability in this setting. Specifically, we introduce a notion of the core for CGBs, both with and without coali...
متن کاملPath coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these games, a coalition of edges or vertices is successful if it can enable an s-t path. We present polynomial-time algorithms to compute and verify least core payoffs of cost-based generalizations of path coalitional game...
متن کاملAlgorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings
A key question in cooperative game theory is that of coalitional stability, usually captured by the notion of the core—the set of outcomes such that no subgroup of players has an incentive to deviate. However, some coalitional games have empty cores, and any outcome in such a game is unstable. In this paper, we investigate the possibility of stabilizing a coalitional game by using external paym...
متن کامل